Aspects of complexity of probabilistic learning under monotonicity constraints

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic learning of indexed families under monotonicity constraints: hierarchy results and complexity aspects

We are concerned with probabilistic identification of indexed families of uniformly recursive languages from positive data under monotonicity constraints. Thereby, we consider conservative, strong-monotonic and monotonic probabilistic learning of indexed families with respect to class comprising, class preserving and proper hypothesis spaces, and investigate the probabilistic hierarchies in the...

متن کامل

Bargaining under Monotonicity Constraints

We study bargaining on the division of a surplus in the presence of monotonicity constraints. The monotonicity constraints specify a complete order on the players, which has to be respected by the shares in the surplus the players obtain in any bargaining outcome. A player higher in the order should not receive a lower share of the surplus. We analyze the resulting subgame perfect equilibria in...

متن کامل

Characterization of language learning front informant under various monotonicity constraints

The present paper deals with monotonic and dual monotonic language learning from positive and negative examples. The three notions of monotonicity re BLOCKINect dierent formalizations of the requirement that the learner has to produce always better and better generalizations when fed more and more data on the concept to be learnt. The three versions of dual monotonicity describe the concept tha...

متن کامل

Learning probabilistic classifiers under computational resource constraints

In many online applications of machine learning, the computational resources available will vary from time-to-time. Surprisingly, existing techniques are designed to accommodate the minimum expected resources, and fail to utilize further resources when they are available. This paper presents an analysis of the relevant categories of computational resource involved, and presents an algorithm tha...

متن کامل

Active Learning with Monotonicity Constraints

In many applications of data mining it is known beforehand that the response variable should be increasing (or decreasing) in the attributes. We propose two algorithms to exploit such monotonicity constraints for active learning in ordinal classification in two different settings. The basis of our approach is the observation that if the class label of an object is given, then the monotonicity c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2001

ISSN: 0304-3975

DOI: 10.1016/s0304-3975(00)00273-5